CCAglucose 2015 in SAT Race 2015
نویسندگان
چکیده
This document describes the SAT solver “CCAglucose2015”, which first empoys a preprocessor CP3, and then calls a hybrid solver combining a local search solver CCAnr and a complete solver glucose.
منابع مشابه
Lingeling and Friends Entering the SAT Race 2015
This is a solver description for our SAT solvers Lingeling, Treengeling and Plingeling entering the SAT Race 2015. We only focus on the difference to their 2014 versions. For further information we refer to previous solver descriptions [1], [2], [3], our POS’14 talk [4] and of course the source code.
متن کاملDCCASatToRiss in SAT Race 2015
This document describes the hybrid SAT solver “DCCASatToRiss”, which is combination of a local search solver and a complete solver.
متن کاملSAT Race 2015
Boolean satisfiability (SAT) solving is one of the most competitive research areas of theoretical computer science. The performance of state-of-the-art SAT solvers has been continuously improving in the last decades and has reached a level where SAT solvers can be employed to solve real world problems in fields such as hardware and software verification, automated planning and many others. One ...
متن کاملThe Growing Correlation between Race and Sat Scores: New Findings from California
ABSTRACT This paper presents new and surprising findings on the relationship between race and SAT scores. The findings are based on the population of California residents who applied for admission to the University of California from 1994 through 2011, a sample of over 1.1 million students. The UC data show that socioeconomic background factors – family income, parental education, and race/ethn...
متن کاملMiniSAT BCD and abcdSAT: Solvers Based on Blocked Clause Decomposition
MiniSAT bcd and abcdSAT are submitted to SAT Race 2015. They both are based on blocked clause decomposition (BCD). Except for that the learnt clause database maintenance is different, their solving policy are the same.
متن کامل